Uncertainty-Based Dynamic Graph Neighborhoods for Medical Segmentation
نویسندگان
چکیده
In recent years, deep learning based methods have shown success in essential medical image analysis tasks such as segmentation. Post-processing and refining the results of segmentation is a common practice to decrease misclassifications originating from network. addition widely used like Conditional Random Fields (CRFs) which focus on structure segmented volume/area, graph-based approach makes use certain uncertain points graph refines according small convolutional network (GCN). However, there are two drawbacks approach: most edges assigned randomly GCN trained independently To address these issues, we define new neighbor-selection mechanism feature distances combine networks training procedure. According experimental pancreas Computed Tomography (CT) images, demonstrate improvement quantitative measures. Also, examining dynamic neighbors created by our method, between semantically similar parts observed. The proposed method also shows qualitative enhancements maps, demonstrated visual results.
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولDynamic graph cut based segmentation of mammogram
This work presents the dynamic graph cut based Otsu's method to segment the masses in mammogram images. Major concern that threatens human life is cancer. Breast cancer is the most common type of disease among women in India and abroad. Breast cancer increases the mortality rate in India especially in women since it is considered to be the second largest form of disease which leads to death. Ma...
متن کاملStatistical Significance Based Graph Cut Regularization for Medical Image Segmentation
Graph cut minimization formulates the image segmentation as a linear combination of problem constraints. The salient constraints of the computer vision problems are data and smoothness which are combined through a regularization parameter. The main task of the regularization parameter is to determine the weight of the smoothness constraint on the graph energy. However, the difference in functio...
متن کاملDynamic neighborhoods in active surfaces for 3D segmentation
Active contours and surfaces are deformable models used for 2D and 3D image segmentation. In this paper, we propose two methods developed in order to accelerate 3D image segmentation process. They are adaptations on active surfaces of two methods developed for 2D active contour. We use them on a discrete 3D surface model (mesh) evolving with the greedy algorithm. Those methods will be compared ...
متن کاملSegmentation of Magnetic Resonance Brain Imaging Based on Graph Theory
Introduction: Segmentation of brain images especially from magnetic resonance imaging (MRI) is an essential requirement in medical imaging since the tissues, edges, and boundaries between them are ambiguous and difficult to detect, due to the proximity of the brightness levels of the images. Material and Methods: In this paper, the graph-base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-87602-9_24